翻訳と辞書 Words near each other ・ Generality of algebra ・ Generalizability theory ・ Generalization ・ Generalization (disambiguation) ・ Generalization (learning) ・ Generalization error ・ Generalizations of Fibonacci numbers ・ Generalizations of Pauli matrices ・ Generalizations of the derivative ・ Generalized additive model ・ Generalized additive model for location, scale and shape ・ Generalized algebraic data type ・ Generalized anxiety disorder ・ Generalized Anxiety Disorder 7 ・ Generalized Appell polynomials ・ Generalized arithmetic progression ・ Generalized assignment problem ・ Generalized audit software ・ Generalized Automation Language ・ Generalized beta distribution ・ Generalized Büchi automaton ・ Generalized canonical correlation ・ Generalized chi-squared distribution ・ Generalized Clifford algebra ・ Generalized complex structure ・ Generalized context-free grammar ・ Generalized continued fraction ・ Generalized coordinates ・ Generalized dihedral group ・ Generalized Dirichlet distribution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Generalized arithmetic progression ： ウィキペディア英語版 Generalized arithmetic progression In mathematics, a multiple arithmetic progression, generalized arithmetic progression, ''k''-dimensional arithmetic progression or a linear set, is a set of integers or tuples of integers constructed as an arithmetic progression is, but allowing several possible differences. So, for example, we start at 17 and may add a multiple of 3 ''or'' of 5, repeatedly. In algebraic terms we look at integers :$a\; +\; mb\; +\; nc\; +\; \backslash ldots$ where $a,\; b,\; c$ and so on are fixed, and $m,\; n$ and so on are confined to some ranges :$0$  ≤  $m$  ≤  $M$ and so on, for a finite progression. The number  $k$, that is the number of permissible differences, is called the ''dimension'' of the generalized progression. More generally, let :$L(C;P)$ be the set of all elements $x$ in $N^n$ of the form :$x\; =\; c\_0\; +\; \backslash sum\_^m\; k\_i\; x\_i,$ with $c\_0$ in $C$, $x\_1,\; \backslash ldots,\; x\_m$ in $P$, and $k\_1,\; \backslash ldots,\; k\_m$ in $N$. $L$ is said to be a ''linear set'' if $C$ consists of exactly one element, and $P$ is finite. A subset of $N^n$ is said to be semilinear if it is a finite union of linear sets. ==See also== * Freiman's theorem 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalized arithmetic progression」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.